Compost: a rule-compiler for speech synthesis

نویسندگان

  • Gérard Bailly
  • A. Tran
چکیده

COMPOST is the result of our first reflections on the computing requirements for synthetic speech generation. It combines the basic facilities of a rule-oriented software with object-oriented design. COMPOST is a tree compiler : it manipulates and transforms not only lists of atoms but also trees and subtrees. Basic atoms involved into the tree inherit of properties of user defined classes Features and numerical cues are associated with each atom. COMPOST has then numerical capabilities to do synthesis-byrule. COMPOST has been developped to build a formant-based rule system but may generate any king of parametric trajectories and then could be used in rule-based articulatory synthesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COMPOST: a client-server model for applications using text-to-speech systems

for applications using text-to-speech systems Mamoun Alissali and Gérard Bailly Institut de la Communication Parlée 46, av. Félix Viallet 38031 Grenoble CEDEX FRANCE [email protected] http:://www.icp.inpg.fr/ bailly Abstract This article presents a Client-Server Model for multilingual text-to-speech synthesis. The server maintains a collection of TTS systems together with related recon gurable...

متن کامل

A Flexible Rule Compiler for Speech Synthesis

We present a exible rule compiler developed for a text-to-speech (TTS) system. The compiler converts a set of rules into a nite-state transducer (FST). The input and output of the FST are subject to parameterization, so that the system can be applied to strings and sequences of feature-structures. The resulting transducer is guaranteed to realize a function (as opposed to a relation), and there...

متن کامل

A Bimachine Compiler for Ranked Tagging Rules

This paper describes a novel method of compiling ranked tagging rules into a deterministic nite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.

متن کامل

A Parser-based Text Preprocessor for Romanian Language Tts Synthesis

Text preprocessing plays an important role in a textto-speech (TTS) synthesis system. The correct detection and interpretation of input strings influence the overall system accuracy and contribute to the conversion of an unrestricted text into synthetic speech. This paper describes the design philosophy of a preprocessing module for a TTS system in Romanian language. The preprocessor is impleme...

متن کامل

On Reductions for Synthesis Procedures

A synthesis procedure acts as a compiler for declarative specifications. It accepts a formula describing a relation between inputs and outputs, and generates a function implementing this relation. This paper presents synthesis procedures for data structures. Our procedures are reductions that lift a synthesis procedure for the elements into synthesis procedures for containers storing these elem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989